An Expectation-Maximization Algorithm for the Fractal Inverse Problem
نویسندگان
چکیده
We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of transformations. The data is a point cloud in R with arbitrary dimension H. Each IFS defines a probability distribution on R , so that the fractal inverse problem can be cast as a problem of parameter estimation. We show that the algorithm reconstructs wellknown fractals from data, with the model converging to high precision parameters. We also show the utility of the model as an approximation for datasources outside the IFS model class.
منابع مشابه
The Development of Maximum Likelihood Estimation Approaches for Adaptive Estimation of Free Speed and Critical Density in Vehicle Freeways
The performance of many traffic control strategies depends on how much the traffic flow models have been accurately calibrated. One of the most applicable traffic flow model in traffic control and management is LWR or METANET model. Practically, key parameters in LWR model, including free flow speed and critical density, are parameterized using flow and speed measurements gathered by inductive ...
متن کاملQuantitative SPECT and planar 32P bremsstrahlung imaging for dosimetry purpose –An experimental phantom study
Background: In this study, Quantitative 32P bremsstrahlung planar and SPECT imaging and consequent dose assessment were carried out as a comprehensive phantom study to define an appropriate method for accurate Dosimetry in clinical practice. Materials and Methods: CT, planar and SPECT bremsstrahlung images of Jaszczak phantom containing a known activity of 32P were acquired. In addition, Phanto...
متن کاملSystem Parameter Estimation in Tomographic Inverse Problems
Inverse problems are typically solved under the assumption of known geometric system parameters describing the forward problem. Should such information be unavailable or inexact, the estimation of these parameters from only observed sensor data may be necessary prior to reconstruction of the desired signal. We demonstrate the feasibility of such estimation via maximum-likelihood methods for the...
متن کاملInverse Reinforcement Learning Under Noisy Observations (Extended Abstract)
We consider the problem of performing inverse reinforcement learning when the trajectory of the expert is not perfectly observed by the learner. Instead, noisy observations of the trajectory are available. We generalize the previous method of expectation-maximization for inverse reinforcement learning, which allows the trajectory of the expert to be partially hidden from the learner, to incorpo...
متن کاملA Type of Inverse Minimum Spanning Tree Problem with Fuzzy Edge Weights
Classic inverse minimum spanning tree problem is to make the least edge weight modification such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. Although many applications can be formulated into this problem, fuzzy parameters are met in some real-world applications. In this paper, a type of inverse minimum spanning tree problem with fuzzy edge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.03149 شماره
صفحات -
تاریخ انتشار 2017